P-Cycle and P-Path dynamic hybrid protection strategies based on block probability for WDM networks
نویسندگان
چکیده
منابع مشابه
P -cycle Based Protection in Wdm Mesh Networks
p-Cycle Based Protection in WDM Mesh Networks Honghui Li, Ph.D. Concordia University, 2012 WDM techniques enable single fiber to carry huge amount of data. However, optical WDM networks are prone to failures, and therefore survivability is a very important requirement in the design of optical networks. In the context of network survivability, p-cycle based schemes attracted extensive research i...
متن کاملDynamic provisioning strategies for energy efficient WDM networks with dedicated path protection
Energy consumption in optical backbone networks is increasing due to two main reasons: (i) the exponential growth of bandwidth demands, and (ii) the increase in availability requirements in order to guarantee protection of the ultra high capacity optical channels provided by wavelength division multiplexing (WDM) networks. Although state of the art reliability mechanisms are very efficient in g...
متن کاملAutomatic Protection Switching for p-Cycles in WDM Networks
p-Cycle recovery relies on a protection switching protocol. We detail several issues for such a protocol taking the evolution from ring networks to p-cycles into account. In particular, we propose and evaluate a protocol enhancement to provide means for node failure protection. For the evaluation, we describe an integer linear program, which is applied to network design case studies, and formul...
متن کاملILP formulations for non-simple p-cycle and p-trail design in WDM mesh networks
Article history: Received 16 July 2008 Received in revised form 18 July 2009 Accepted 30 September 2009 Available online 12 October 2009 Responsible Editor: A.K. Somani
متن کاملEfficient p-Cycles Design By Heuristic p-Cycle Selection and Refinement for Survivable WDM Mesh Networks
Using p-Cycles to protect against single span failures in Wavelength-Division Multiplexing (WDM) networks has been widely studied. p-Cycle retains not only the speed of ring-like restoration, but also achieves the capacity efficiency over mesh networks. However, in selecting an optimal set of p-cycles to achieve the minimum spare capacity and fast computational time is an NP-hard problem. To ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2010
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2010.06.004